Resolving Goodman’s Paradox How to Defuse Inductive Skepticism
نویسنده
چکیده
Subjective Bayesian inference is unsuitable as an ideal for learning strategies to approximate, as the arbitrariness in prior probabilities makes claims to Bayesian learning too easily vulnerable to inductive skepticism. An objective Bayesian approach, which determines priors by maximizing information entropy, runs into insurmountable difficulties in conditions where no definite background theory is available. However, this lack of background knowledge makes the maximum entropy argument directly applicable to the process of drawing samples from a population. As a result, evidence can be seen not just as eliminating a number of incompatible hypotheses out of an infinity of possibilities, but as being representative of the true state of affairs. Hence inductive skepticism can be avoided, as demonstrated by a resolution of Goodman’s ‘grue’ paradox. This leads to a clearer understanding of the vital role abductive processes and tools like simple generalization play in learning.
منابع مشابه
Learning and using relational theories: supporting material
We previously considered a Bayesian model based on our complexity measure, but Equations 2 and 3 can also be used to define a Bayesian model based on Goodman’s measure. The left columns show predictions when this model is applied to the inductive tasks in our first experiment. In order to combine Goodman’s model with Equations 2 and 3, each T in these equations must now refer to a candidate ext...
متن کاملGoodman’s “Grue” Argument in Historical Perspective
I will focus on arguments against classical deductive and inductive logic (“relevantist” and “grue” arguments). The talk is mainly defensive. I won’t offer positive accounts of the “paradoxical” cases I will discuss (but, see “Extras”). I’ll begin with Harman’s defense of classical deductive logic against certain (epistemological) “relevantist” arguments. Then, I’ll argue that if you like Harma...
متن کاملA Pragmatic Theory of Induction
This paper develops a qualitative, logical, theory of induction. It begins with Hempel’s attempt to produce a “purely syntactical” theory of confirmation and the demise of this attempt as a result of Goodman’s paradox. Ideas from the informal, pragmatic, solutions to this paradox proposed by Goodman and Quine are then adopted, adapted and extended in order to produce a formal, pragmatic theory ...
متن کاملGreen is Simpler than Grue ∗
Goodman’s grue-bleen paradox relies on the claim that the predicate “green” is not simpler than the predicate “grue”, and that, for that reason, the choice between them is arbitrary. It is argued that this claim can only be made in a restricted model, in which functions have primitive names but particular values do not. In more natural models, which allow values to have proper names as well, th...
متن کاملTestability and Ockham's Razor: How Formal and Statistical Learning Theory Converge in the New Riddle of Induction
Nelson Goodman’s new riddle of induction forcefully illustrates a basic challenge that must be confronted by any adequate theory of inductive inference: provide some basis for choosing among alternative hypotheses that fit past data but make divergent predictions. One response to this challenge is to appeal to some version of Ockham’s razor, according to which simpler hypotheses should be prefe...
متن کامل